Sampled-Data Stabilization With Control Lyapunov Functions via Quadratically Constrained Quadratic Programs
نویسندگان
چکیده
Controller design for nonlinear systems with Control Lyapunov Function (CLF) based quadratic programs has recently been successfully applied to a diverse set of difficult control tasks. These existing formulations do not address the gap between continuous time models and discrete sampled implementation resulting controllers, often leading poor performance on hardware platforms. We propose an approach close this by synthesizing sampled-data counterparts these CLF-based specified as quadratically constrained (QCQPs). Assuming feedback linearizability stable zero-dynamics system's model, we derive practical stability guarantees system. demonstrate improved proposed over in simulation.
منابع مشابه
Reformulating Mixed-Integer Quadratically Constrained Quadratic Programs
It is well known that semidefinite programming (SDP) can be used to derive useful relaxations for a variety of optimisation problems. Moreover, in the particular case of mixed-integer quadratic programs, SDP has been used to reformulate problems, rather than merely relax them. The purpose of reformulation is to strengthen the continuous relaxation of the problem, while leaving the optimal solut...
متن کاملData Structures for Representing Symmetry in Quadratically Constrained Quadratic Programs
Symmetry in mathematical programming may lead to a multiplicity of solutions. In nonconvex optimisation, it can negatively affect the performance of the Branch and Bound algorithm. Symmetry may induce large search trees with multiple equivalent solutions, i.e. with the same optimal value. Dealing with symmetry requires detecting and classifying it first. This paper develops several methods for ...
متن کاملConvex quadratic relaxations of nonconvex quadratically constrained quadratic programs
Nonconvex quadratic constraints can be linearized to obtain relaxations in a wellunderstood manner. We propose to tighten the relaxation by using second order cone constraints, resulting in a convex quadratic relaxation. Our quadratic approximation to the bilinear term is compared to the linear McCormick bounds. The second order cone constraints are based on linear combinations of pairs of vari...
متن کاملRepresenting quadratically constrained quadratic programs as generalized copositive programs
We show that any nonconvex quadratically constrained quadratic program (QCQP) can be represented as a generalized copositive program. In fact, we provide two representations. The first is based on the concept of completely positive (CP) matrices over second order cones, while the second is based on CP matrices over the positive semidefinte cone. Our analysis assumes that the feasible region of ...
متن کاملComposite quadratic Lyapunov functions for constrained control systems
The composite quadratic function based on a group of quadratic functions was introduced in our recent paper [7]. Some important properties of this Lyapunov function were revealed. We showed that this function is continuously differentiable and its level set is the convex hull of a group of ellipsoids. In this paper, we use these results to study the set invariance properties of linear systems w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Control Systems Letters
سال: 2022
ISSN: ['2475-1456']
DOI: https://doi.org/10.1109/lcsys.2021.3085172